Capacity and error bounds for a time-continuous Gaussian channel
نویسندگان
چکیده
منابع مشابه
Capacity Bounds and Achievable Rates of the Gaussian Relay Channel
We present capacity bounds and achievable rates of the Gaussian relay channel. To evaluate achievable rates we consider two cooperative strategies: decode and forward (DF) and compress and forward (CF). We investigate the impact of different channel conditions of the transmitter-relay, relay-receiver, and transmitter-receiver transmission on the bounds and rates. We also compare the results to ...
متن کاملLower Bounds on the Capacity of Gaussian Relay Channel
It has been shown recently that the overall throughput of dense wireless networks can increase significantly when wireless nodes collaborate in transmission of different packets. In this paper, we focus on a simple network known as the relay channel, where there is a single relaying node in the system assisting a sender-receiver pair. We present a new achievable rate for the case of Gaussian re...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملThe capacity for the linear time-invariant Gaussian relay channel
In this paper, the Gaussian relay channel with linear time-invariant relay filtering is considered. Based on spectral theory for stationary processes, the maximum achievable rate for this subclass of linear Gaussian relay operation is obtained in finite-letter characterization. The maximum rate can be achieved by dividing the overall frequency band into at most eight subbands and by making the ...
متن کاملImproved Capacity Upper Bounds for the Discrete-Time Poisson Channel
We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1963
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(63)90083-4